Bicliques and Eigenvalues
نویسنده
چکیده
A biclique in a graph Γ is a complete bipartite subgraph of Γ. We give bounds for the maximum number of edges in a biclique in terms of the eigenvalues of matrix representations of Γ. These bounds show a strong similarity with Lovász’s bound θ(Γ) for the Shannon capacity of Γ. Motivated by this similarity we investigate bicliques and the bounds in certain product graphs.
منابع مشابه
Exploring the "Middle Earth" of Network Spectra via a Gaussian Matrix Function
We study a Gaussian matrix function of the adjacency matrix of artificial and real-world networks. We motivate the use of this function on the basis of a dynamical process modeled by the time-dependent Schrödinger equation with a squared Hamiltonian. In particular, we study the Gaussian Estrada index-an index characterizing the importance of eigenvalues close to zero. This index accounts for th...
متن کاملExtracting large quasi-bicliques using a skeleton-based heuristic
............................................................................................................ iv Chapter 1 Introduction 1.1 Motivation ......................................................................................... 1 1.2 Preliminaries, notation, terminology and definitions ........................ 4 1.3 Quasi – biclique literature review....................................
متن کاملMining maximal quasi-bicliques: Novel algorithm and applications in the stock market and protein networks
Several real world applications require mining of bicliques, as they represent correlated pairs of data clusters. However, the mining quality is adversely affected by missing and noisy data. Moreover, some applications only require strong interactions between data members of the pairs, but bicliques are pairs that display complete interactions. We address these two limitations by proposing maxi...
متن کاملIncremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph
We consider incremental maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition of edges. When new edges are added to the graph, we seek to enumerate the change in the set of maximal bicliques, without enumerating the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to enumerate the change without expl...
متن کاملDistances between bicliques and structural properties of bicliques in graphs
A biclique is a maximal bipartite complete induced subgraph of G. The biclique graph of a graph G, denoted by KB(G), is the intersection graph of the family of all bicliques of G. In this work we give a natural definition of the distance between bicliques in a graph. We give a useful formula that relates the distance between bicliques in a graph G and the distance between their respectives vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 82 شماره
صفحات -
تاریخ انتشار 2001